Parallel filtering scheme for fast symmetrical component extraction based on asynchronous coordinate transformation

نویسندگان

چکیده

The common shortage of the existing methods for extracting symmetrical components from unbalanced and distorted three-phase voltages is that they introduce significant time delay before reaching an accurate result. Therefore, this paper presents a new filtering method to fast extract positive sequence component based on asynchronous coordinate transformation. Unlike conventional filter out harmonics in sequence, resulting cascading delay, proposed has two signal streams operating parallel, which particular refer negative extraction harmonic filtering, respectively, then can be easily derived by skillfully combining results streams. In theory, only suffers largest introduced these By carefully designing transformation, restricted, thus improving overall performance. Simulation experimental verified performance method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asynchronous Parallel Greedy Coordinate Descent

In this paper, we propose and study an Asynchronous parallel Greedy Coordinate Descent (Asy-GCD) algorithm for minimizing a smooth function with bounded constraints. At each iteration, workers asynchronously conduct greedy coordinate descent updates on a block of variables. In the first part of the paper, we analyze the theoretical behavior of Asy-GCD and prove a linear convergence rate. In the...

متن کامل

Asynchronous Parallel Coordinate Minimization for MAP Inference

Finding the maximum a-posteriori (MAP) assignment is a central task for structured prediction. Since modern applications give rise to very large structured problem instances, there is increasing need for efficient solvers. In this work we propose to improve the efficiency of coordinate-minimization-based dual-decomposition solvers by running their updates asynchronously in parallel. In this cas...

متن کامل

An Asynchronous Parallel Stochastic Coordinate Descent Algorithm

We describe an asynchronous parallel stochastic coordinate descent algorithm for minimizing smooth unconstrained or separably constrained functions. The method achieves a linear convergence rate on functions that satisfy an essential strong convexity property and a sublinear rate (1/K) on general convex functions. Near-linear speedup on a multicore system can be expected if the number of proces...

متن کامل

Generalized coordinate transformation and gas-kinetic scheme

Article history: Received 3 March 2014 Received in revised form 25 November 2014 Accepted 3 February 2015 Available online 11 February 2015

متن کامل

ARock: an Algorithmic Framework for Asynchronous Parallel Coordinate Updates

Finding a fixed point to a nonexpansive operator, i.e., x∗ = Tx∗, abstracts many problems in numerical linear algebra, optimization, and other areas of scientific computing. To solve fixed-point problems, we propose ARock, an algorithmic framework in which multiple agents (machines, processors, or cores) update x in an asynchronous parallel fashion. Asynchrony is crucial to parallel computing s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Frontiers in Energy Research

سال: 2023

ISSN: ['2296-598X']

DOI: https://doi.org/10.3389/fenrg.2023.1206248